Propositional Argumentation Systems vs Theorist
نویسندگان
چکیده
Propositional argumentation systems are based on assumption based reasoning and used for computing arguments which support a given hypotheses Assumption based reasoning is closely related to hypothetical default theories or inference through theory formation The latter approach known as the Theorist frame work has well known relations to abduction and default reasoning In this paper propositional argumentation systems are presented as an alternative to hypo thetical default theories and their relations to hypothetical default theories are explained The presented transformation from hypothetical default theories into propositional argumentation systems allows us to characterize all notions of hypo thetical reasoning in terms of argumentation systems The presented transforma tion is linear There exists also an inverse transformation which is partial in the sense that not all notions of propositional argumentation systems can be expressed in the framework of hypothetical default theories
منابع مشابه
Embedding default logic in propositional argumentation systems
In this paper we present a transformation of finite propositional default theories into socalled propositional argumentation systems. This transformation allows to characterize all notions of Reiter’s default logic in the framework of argumentation systems. As a consequence, computing extensions, or determining wether a given formula belongs to one extension or all extensions can be answered wi...
متن کاملBuilding Argumentation Systems on Set Constraint Logic
The purpose of this paper is to show how the theory of probabilistic argumentation systems can be extended from propositional logic to the more general framework of set constraint logic. The strength of set constraint logic is that logical relations between non-binary variables can be expressed more directly. This simplifies the classical way of modeling knowledge through propositional logic. B...
متن کاملEmbedding Default Theories in Propositional Argumentation Systems
In this paper we present a transformation of propositional default theories into so-called propositional argumentation systems. This transformation allows to characterize all notions of Reiter’s default logic in the framework of argumentation systems. This means that computing extension, or determining if a given formula belongs to one extension or all extensions can be answered without leaving...
متن کاملPropositional Argumentation and Causal Reasoning
The paper introduces a number of propositional argumentation systems obtained by gradually extending the underlying language and associated monotonic logics. An assumption-based argumentation framework [Bondarenko et al., 1997] will constitute a special case of this construction. In addition, a stronger argumentation system in a full classical language will be shown to be equivalent to a system...
متن کاملEnforcement in Argumentation Is a Kind of Update
In the literature, enforcement consists in changing an argumentation system in order to force it to accept a given set of arguments. In this paper, we extend this notion by allowing incomplete information about the initial argumentation system. Generalized enforcement is an operation that maps a propositional formula describing a system and a propositional formula that describes a goal, to a ne...
متن کامل